Normal curvatures of asymptotically constant graphs and Carathéodory’s conjecture
نویسندگان
چکیده
منابع مشابه
Normal Curvatures of Asymptotically Constant Graphs and Carathéodory’s Conjecture
We show that Carathéodory’s conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f : R → R whose gradient decays uniformly faster than 1/r. The divergence theorem then yields a pair of integral equations for the normal curvatures of these graphs, which establish some weaker forms of the conjec...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولTotally umbilical radical transversal lightlike hypersurfaces of Kähler-Norden manifolds of constant totally real sectional curvatures
In this paper we study curvature properties of semi - symmetric type of totally umbilical radical transversal lightlike hypersurfaces $(M,g)$ and $(M,widetilde g)$ of a K"ahler-Norden manifold $(overline M,overline J,overline g,overline { widetilde g})$ of constant totally real sectional curvatures $overline nu$ and $overline {widetilde nu}$ ($g$ and $widetilde g$ are the induced metrics on $M$...
متن کاملCounting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k − 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the probabilistic method, analyzing breadth-first search on the random graph G(k, p) for an appropriate edge probability p. Central is analysis of a random walk with fixed beginning and end which is tilted to the left.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2012
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2012-11420-0